Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
نویسندگان
چکیده
منابع مشابه
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2O(tw)|V |O(1) time for graphs G = (V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not know how to do this faster than twO(tw)|V |O(1). Recently, Cygan et al. (FOCS 2011) presented M...
متن کاملProblems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
We introduce a variant of modal logic, dubbed EXISTENTIAL COUNTING MODAL LOGIC (ECML), which captures a vast majority of problems known to be tractable in single exponential time when parameterized by treewidth. It appears that all these results can be subsumed by the theorem that model checking of ECML admits an algorithm with such complexity. We extend ECML by adding connectivity requirements...
متن کاملThe Role of Planarity in Connectivity Problems Parameterized by Treewidth
For some years it was believed that for “connectivity” problems such as Hamiltonian Cycle, algorithms running in time 2 ·n –called singleexponential– existed only on planar and other sparse graph classes, where tw stands for the treewidth of the n-vertex input graph. This was recently disproved by Cygan et al. [FOCS 2011] and Bodlaender et al. [ICALP 2013], who provided single-exponential algor...
متن کاملDouble-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth
Choosability, introduced by Erdős, Rubin, and Taylor [Congr. Number. 1979], is a well-studied concept in graph theory: we say that a graph is c-choosable if for any assignment of a list of c colors to each vertex, there is a proper coloring where each vertex uses a color from its list. We study the complexity of deciding choosability on graphs of bounded treewidth. It follows from earlier work ...
متن کاملA Deterministic Single Exponential Time Algorithm for Most Lattice Problems
We give deterministic Õ(2)-time algorithms to solve all the most important computational problems on point lattices in NP, including the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), and Shortest Independent Vectors Problem (SIVP). This improves the n running time of the best previously known algorithms for CVP (Kannan, Math. Operation Research 12(3):415-440, 1987) and SIVP (Micc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2015
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.12.008